Fast graph operations in quantum computation

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast graph operations in quantum computation

The connection between certain entangled states and graphs has been heavily studied in the context of measurement-based quantum computation as a tool for understanding entanglement. Here we show that this correspondence can be harnessed in the reverse direction to yield a graph data structure which allows for more efficient manipulation and comparison of graphs than any possible classical struc...

متن کامل

Fast Computation of Graph Kernels

Using extensions of linear algebra concepts to Reproducing Kernel Hilbert Spaces (RKHS), we define a unifying framework for random walk kernels on graphs. Reduction to a Sylvester equation allows us to compute many of these kernels in O(n) worst-case time. This includes kernels whose previous worst-case time complexity was O(n), such as the geometric kernels of Gärtner et al. [1] and the margin...

متن کامل

Applications of Graph Operations

In this paper, some applications of our earlier results in working with chemical graphs are presented.

متن کامل

Quantum computation with commuting operations Master Thesis

Introduction Quantum physics has changed our world dramatically, from Laser pointers in our hand to our understanding of black holes. However, it is only lately that people start to ask whether quantum mechanics can be employed to make better computers or other information processing instruments. Around 1980, Richard Feynman and other scientists [1, 2] started to consider the possibility of usi...

متن کامل

Fast Iterative Graph Computation with Block Updates

Scaling iterative graph processing applications to large graphs is an important problem. Performance is critical, as data scientists need to execute graph programs many times with varying parameters. The need for a high-level, high-performance programming model has inspired much research on graph programming frameworks. In this paper, we show that the important class of computationally light gr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical Review A

سال: 2016

ISSN: 2469-9926,2469-9934

DOI: 10.1103/physreva.93.032314